Effect of geometric models on convergence rate in iterative PET image reconstructions
نویسنده
چکیده
Iterative PET image reconstructions can improve quantitation accuracy by explicitly modeling photon-limited nature and physical effects of coincident photons. Geometric model in iterative reconstructions defines the mapping between image and sinogram domains based on scanners geometry, which affects the accuracy of image results and the convergence rate of reconstruction algorithms. This paper examines the convergence rates of a reconstruction algorithm with three PET geometric models: interpolative, area-based, and solid-angle. The iterative algorithm used in this study is the maximum likelihood expectation-maximization (MLEM) algorithm. Experimental data are generated by the GATE package which simulates the Inveon microPET system. The comparison of convergence rate is based on the plot of log-likelihood value versus iteration number. From the plots of log-likelihood curves, the results from solid-angle model consistently reach the highest values at early iterations. It means that the MLEM algorithm with the solid-angle model will converge faster than the other two models. The experimental results indicate that the solid-angle model is a favorable geometric model for faster iterative PET image reconstruction.
منابع مشابه
On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009